pairNs → cons(0, n__incr(n__oddNs))
oddNs → incr(pairNs)
incr(cons(X, XS)) → cons(s(X), n__incr(activate(XS)))
take(0, XS) → nil
take(s(N), cons(X, XS)) → cons(X, n__take(N, activate(XS)))
zip(nil, XS) → nil
zip(X, nil) → nil
zip(cons(X, XS), cons(Y, YS)) → cons(pair(X, Y), n__zip(activate(XS), activate(YS)))
tail(cons(X, XS)) → activate(XS)
repItems(nil) → nil
repItems(cons(X, XS)) → cons(X, n__cons(X, n__repItems(activate(XS))))
incr(X) → n__incr(X)
oddNs → n__oddNs
take(X1, X2) → n__take(X1, X2)
zip(X1, X2) → n__zip(X1, X2)
cons(X1, X2) → n__cons(X1, X2)
repItems(X) → n__repItems(X)
activate(n__incr(X)) → incr(activate(X))
activate(n__oddNs) → oddNs
activate(n__take(X1, X2)) → take(activate(X1), activate(X2))
activate(n__zip(X1, X2)) → zip(activate(X1), activate(X2))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__repItems(X)) → repItems(activate(X))
activate(X) → X
↳ QTRS
↳ DependencyPairsProof
pairNs → cons(0, n__incr(n__oddNs))
oddNs → incr(pairNs)
incr(cons(X, XS)) → cons(s(X), n__incr(activate(XS)))
take(0, XS) → nil
take(s(N), cons(X, XS)) → cons(X, n__take(N, activate(XS)))
zip(nil, XS) → nil
zip(X, nil) → nil
zip(cons(X, XS), cons(Y, YS)) → cons(pair(X, Y), n__zip(activate(XS), activate(YS)))
tail(cons(X, XS)) → activate(XS)
repItems(nil) → nil
repItems(cons(X, XS)) → cons(X, n__cons(X, n__repItems(activate(XS))))
incr(X) → n__incr(X)
oddNs → n__oddNs
take(X1, X2) → n__take(X1, X2)
zip(X1, X2) → n__zip(X1, X2)
cons(X1, X2) → n__cons(X1, X2)
repItems(X) → n__repItems(X)
activate(n__incr(X)) → incr(activate(X))
activate(n__oddNs) → oddNs
activate(n__take(X1, X2)) → take(activate(X1), activate(X2))
activate(n__zip(X1, X2)) → zip(activate(X1), activate(X2))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__repItems(X)) → repItems(activate(X))
activate(X) → X
TAKE(s(N), cons(X, XS)) → CONS(X, n__take(N, activate(XS)))
INCR(cons(X, XS)) → ACTIVATE(XS)
ACTIVATE(n__zip(X1, X2)) → ACTIVATE(X1)
ZIP(cons(X, XS), cons(Y, YS)) → ACTIVATE(YS)
ACTIVATE(n__take(X1, X2)) → TAKE(activate(X1), activate(X2))
ACTIVATE(n__zip(X1, X2)) → ZIP(activate(X1), activate(X2))
INCR(cons(X, XS)) → CONS(s(X), n__incr(activate(XS)))
PAIRNS → CONS(0, n__incr(n__oddNs))
ACTIVATE(n__cons(X1, X2)) → ACTIVATE(X1)
REPITEMS(cons(X, XS)) → ACTIVATE(XS)
ACTIVATE(n__incr(X)) → ACTIVATE(X)
ACTIVATE(n__repItems(X)) → ACTIVATE(X)
REPITEMS(cons(X, XS)) → CONS(X, n__cons(X, n__repItems(activate(XS))))
TAIL(cons(X, XS)) → ACTIVATE(XS)
ZIP(cons(X, XS), cons(Y, YS)) → ACTIVATE(XS)
ACTIVATE(n__incr(X)) → INCR(activate(X))
ACTIVATE(n__take(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n__cons(X1, X2)) → CONS(activate(X1), X2)
ODDNS → INCR(pairNs)
ACTIVATE(n__take(X1, X2)) → ACTIVATE(X2)
TAKE(s(N), cons(X, XS)) → ACTIVATE(XS)
ODDNS → PAIRNS
ZIP(cons(X, XS), cons(Y, YS)) → CONS(pair(X, Y), n__zip(activate(XS), activate(YS)))
ACTIVATE(n__repItems(X)) → REPITEMS(activate(X))
ACTIVATE(n__zip(X1, X2)) → ACTIVATE(X2)
ACTIVATE(n__oddNs) → ODDNS
pairNs → cons(0, n__incr(n__oddNs))
oddNs → incr(pairNs)
incr(cons(X, XS)) → cons(s(X), n__incr(activate(XS)))
take(0, XS) → nil
take(s(N), cons(X, XS)) → cons(X, n__take(N, activate(XS)))
zip(nil, XS) → nil
zip(X, nil) → nil
zip(cons(X, XS), cons(Y, YS)) → cons(pair(X, Y), n__zip(activate(XS), activate(YS)))
tail(cons(X, XS)) → activate(XS)
repItems(nil) → nil
repItems(cons(X, XS)) → cons(X, n__cons(X, n__repItems(activate(XS))))
incr(X) → n__incr(X)
oddNs → n__oddNs
take(X1, X2) → n__take(X1, X2)
zip(X1, X2) → n__zip(X1, X2)
cons(X1, X2) → n__cons(X1, X2)
repItems(X) → n__repItems(X)
activate(n__incr(X)) → incr(activate(X))
activate(n__oddNs) → oddNs
activate(n__take(X1, X2)) → take(activate(X1), activate(X2))
activate(n__zip(X1, X2)) → zip(activate(X1), activate(X2))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__repItems(X)) → repItems(activate(X))
activate(X) → X
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
TAKE(s(N), cons(X, XS)) → CONS(X, n__take(N, activate(XS)))
INCR(cons(X, XS)) → ACTIVATE(XS)
ACTIVATE(n__zip(X1, X2)) → ACTIVATE(X1)
ZIP(cons(X, XS), cons(Y, YS)) → ACTIVATE(YS)
ACTIVATE(n__take(X1, X2)) → TAKE(activate(X1), activate(X2))
ACTIVATE(n__zip(X1, X2)) → ZIP(activate(X1), activate(X2))
INCR(cons(X, XS)) → CONS(s(X), n__incr(activate(XS)))
PAIRNS → CONS(0, n__incr(n__oddNs))
ACTIVATE(n__cons(X1, X2)) → ACTIVATE(X1)
REPITEMS(cons(X, XS)) → ACTIVATE(XS)
ACTIVATE(n__incr(X)) → ACTIVATE(X)
ACTIVATE(n__repItems(X)) → ACTIVATE(X)
REPITEMS(cons(X, XS)) → CONS(X, n__cons(X, n__repItems(activate(XS))))
TAIL(cons(X, XS)) → ACTIVATE(XS)
ZIP(cons(X, XS), cons(Y, YS)) → ACTIVATE(XS)
ACTIVATE(n__incr(X)) → INCR(activate(X))
ACTIVATE(n__take(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n__cons(X1, X2)) → CONS(activate(X1), X2)
ODDNS → INCR(pairNs)
ACTIVATE(n__take(X1, X2)) → ACTIVATE(X2)
TAKE(s(N), cons(X, XS)) → ACTIVATE(XS)
ODDNS → PAIRNS
ZIP(cons(X, XS), cons(Y, YS)) → CONS(pair(X, Y), n__zip(activate(XS), activate(YS)))
ACTIVATE(n__repItems(X)) → REPITEMS(activate(X))
ACTIVATE(n__zip(X1, X2)) → ACTIVATE(X2)
ACTIVATE(n__oddNs) → ODDNS
pairNs → cons(0, n__incr(n__oddNs))
oddNs → incr(pairNs)
incr(cons(X, XS)) → cons(s(X), n__incr(activate(XS)))
take(0, XS) → nil
take(s(N), cons(X, XS)) → cons(X, n__take(N, activate(XS)))
zip(nil, XS) → nil
zip(X, nil) → nil
zip(cons(X, XS), cons(Y, YS)) → cons(pair(X, Y), n__zip(activate(XS), activate(YS)))
tail(cons(X, XS)) → activate(XS)
repItems(nil) → nil
repItems(cons(X, XS)) → cons(X, n__cons(X, n__repItems(activate(XS))))
incr(X) → n__incr(X)
oddNs → n__oddNs
take(X1, X2) → n__take(X1, X2)
zip(X1, X2) → n__zip(X1, X2)
cons(X1, X2) → n__cons(X1, X2)
repItems(X) → n__repItems(X)
activate(n__incr(X)) → incr(activate(X))
activate(n__oddNs) → oddNs
activate(n__take(X1, X2)) → take(activate(X1), activate(X2))
activate(n__zip(X1, X2)) → zip(activate(X1), activate(X2))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__repItems(X)) → repItems(activate(X))
activate(X) → X
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
INCR(cons(X, XS)) → ACTIVATE(XS)
ACTIVATE(n__zip(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n__incr(X)) → INCR(activate(X))
ZIP(cons(X, XS), cons(Y, YS)) → ACTIVATE(YS)
ACTIVATE(n__take(X1, X2)) → TAKE(activate(X1), activate(X2))
ACTIVATE(n__take(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n__zip(X1, X2)) → ZIP(activate(X1), activate(X2))
ODDNS → INCR(pairNs)
ACTIVATE(n__take(X1, X2)) → ACTIVATE(X2)
TAKE(s(N), cons(X, XS)) → ACTIVATE(XS)
ACTIVATE(n__cons(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n__repItems(X)) → REPITEMS(activate(X))
REPITEMS(cons(X, XS)) → ACTIVATE(XS)
ACTIVATE(n__incr(X)) → ACTIVATE(X)
ACTIVATE(n__repItems(X)) → ACTIVATE(X)
ACTIVATE(n__zip(X1, X2)) → ACTIVATE(X2)
ACTIVATE(n__oddNs) → ODDNS
ZIP(cons(X, XS), cons(Y, YS)) → ACTIVATE(XS)
pairNs → cons(0, n__incr(n__oddNs))
oddNs → incr(pairNs)
incr(cons(X, XS)) → cons(s(X), n__incr(activate(XS)))
take(0, XS) → nil
take(s(N), cons(X, XS)) → cons(X, n__take(N, activate(XS)))
zip(nil, XS) → nil
zip(X, nil) → nil
zip(cons(X, XS), cons(Y, YS)) → cons(pair(X, Y), n__zip(activate(XS), activate(YS)))
tail(cons(X, XS)) → activate(XS)
repItems(nil) → nil
repItems(cons(X, XS)) → cons(X, n__cons(X, n__repItems(activate(XS))))
incr(X) → n__incr(X)
oddNs → n__oddNs
take(X1, X2) → n__take(X1, X2)
zip(X1, X2) → n__zip(X1, X2)
cons(X1, X2) → n__cons(X1, X2)
repItems(X) → n__repItems(X)
activate(n__incr(X)) → incr(activate(X))
activate(n__oddNs) → oddNs
activate(n__take(X1, X2)) → take(activate(X1), activate(X2))
activate(n__zip(X1, X2)) → zip(activate(X1), activate(X2))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__repItems(X)) → repItems(activate(X))
activate(X) → X
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
ACTIVATE(n__take(X1, X2)) → TAKE(activate(X1), activate(X2))
ACTIVATE(n__take(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n__take(X1, X2)) → ACTIVATE(X2)
ACTIVATE(n__repItems(X)) → REPITEMS(activate(X))
ACTIVATE(n__repItems(X)) → ACTIVATE(X)
Used ordering: Polynomial interpretation [25,35]:
INCR(cons(X, XS)) → ACTIVATE(XS)
ACTIVATE(n__zip(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n__incr(X)) → INCR(activate(X))
ZIP(cons(X, XS), cons(Y, YS)) → ACTIVATE(YS)
ACTIVATE(n__zip(X1, X2)) → ZIP(activate(X1), activate(X2))
ODDNS → INCR(pairNs)
TAKE(s(N), cons(X, XS)) → ACTIVATE(XS)
ACTIVATE(n__cons(X1, X2)) → ACTIVATE(X1)
REPITEMS(cons(X, XS)) → ACTIVATE(XS)
ACTIVATE(n__incr(X)) → ACTIVATE(X)
ACTIVATE(n__zip(X1, X2)) → ACTIVATE(X2)
ACTIVATE(n__oddNs) → ODDNS
ZIP(cons(X, XS), cons(Y, YS)) → ACTIVATE(XS)
The value of delta used in the strict ordering is 2.
POL(zip(x1, x2)) = x_1 + x_2
POL(n__incr(x1)) = (4)x_1
POL(oddNs) = 0
POL(n__cons(x1, x2)) = (2)x_1 + x_2
POL(n__repItems(x1)) = 2 + (4)x_1
POL(activate(x1)) = x_1
POL(take(x1, x2)) = 4 + x_1 + (4)x_2
POL(0) = 0
POL(repItems(x1)) = 2 + (4)x_1
POL(REPITEMS(x1)) = (4)x_1
POL(ODDNS) = 0
POL(cons(x1, x2)) = (2)x_1 + x_2
POL(TAKE(x1, x2)) = (4)x_2
POL(incr(x1)) = (4)x_1
POL(n__take(x1, x2)) = 4 + x_1 + (4)x_2
POL(n__oddNs) = 0
POL(pair(x1, x2)) = x_1 + x_2
POL(s(x1)) = (3)x_1
POL(pairNs) = 0
POL(ZIP(x1, x2)) = x_1 + x_2
POL(n__zip(x1, x2)) = x_1 + x_2
POL(ACTIVATE(x1)) = x_1
POL(INCR(x1)) = (2)x_1
POL(nil) = 3
zip(cons(X, XS), cons(Y, YS)) → cons(pair(X, Y), n__zip(activate(XS), activate(YS)))
zip(nil, XS) → nil
zip(X, nil) → nil
incr(X) → n__incr(X)
oddNs → n__oddNs
repItems(nil) → nil
repItems(cons(X, XS)) → cons(X, n__cons(X, n__repItems(activate(XS))))
cons(X1, X2) → n__cons(X1, X2)
repItems(X) → n__repItems(X)
take(X1, X2) → n__take(X1, X2)
zip(X1, X2) → n__zip(X1, X2)
activate(n__take(X1, X2)) → take(activate(X1), activate(X2))
activate(n__zip(X1, X2)) → zip(activate(X1), activate(X2))
activate(n__incr(X)) → incr(activate(X))
activate(n__oddNs) → oddNs
activate(X) → X
activate(n__repItems(X)) → repItems(activate(X))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
pairNs → cons(0, n__incr(n__oddNs))
incr(cons(X, XS)) → cons(s(X), n__incr(activate(XS)))
oddNs → incr(pairNs)
take(s(N), cons(X, XS)) → cons(X, n__take(N, activate(XS)))
take(0, XS) → nil
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
INCR(cons(X, XS)) → ACTIVATE(XS)
ACTIVATE(n__zip(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n__incr(X)) → INCR(activate(X))
ZIP(cons(X, XS), cons(Y, YS)) → ACTIVATE(YS)
ACTIVATE(n__zip(X1, X2)) → ZIP(activate(X1), activate(X2))
ODDNS → INCR(pairNs)
TAKE(s(N), cons(X, XS)) → ACTIVATE(XS)
ACTIVATE(n__cons(X1, X2)) → ACTIVATE(X1)
REPITEMS(cons(X, XS)) → ACTIVATE(XS)
ACTIVATE(n__incr(X)) → ACTIVATE(X)
ACTIVATE(n__zip(X1, X2)) → ACTIVATE(X2)
ACTIVATE(n__oddNs) → ODDNS
ZIP(cons(X, XS), cons(Y, YS)) → ACTIVATE(XS)
pairNs → cons(0, n__incr(n__oddNs))
oddNs → incr(pairNs)
incr(cons(X, XS)) → cons(s(X), n__incr(activate(XS)))
take(0, XS) → nil
take(s(N), cons(X, XS)) → cons(X, n__take(N, activate(XS)))
zip(nil, XS) → nil
zip(X, nil) → nil
zip(cons(X, XS), cons(Y, YS)) → cons(pair(X, Y), n__zip(activate(XS), activate(YS)))
tail(cons(X, XS)) → activate(XS)
repItems(nil) → nil
repItems(cons(X, XS)) → cons(X, n__cons(X, n__repItems(activate(XS))))
incr(X) → n__incr(X)
oddNs → n__oddNs
take(X1, X2) → n__take(X1, X2)
zip(X1, X2) → n__zip(X1, X2)
cons(X1, X2) → n__cons(X1, X2)
repItems(X) → n__repItems(X)
activate(n__incr(X)) → incr(activate(X))
activate(n__oddNs) → oddNs
activate(n__take(X1, X2)) → take(activate(X1), activate(X2))
activate(n__zip(X1, X2)) → zip(activate(X1), activate(X2))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__repItems(X)) → repItems(activate(X))
activate(X) → X
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
ACTIVATE(n__zip(X1, X2)) → ACTIVATE(X1)
INCR(cons(X, XS)) → ACTIVATE(XS)
ACTIVATE(n__cons(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n__incr(X)) → INCR(activate(X))
ZIP(cons(X, XS), cons(Y, YS)) → ACTIVATE(YS)
ACTIVATE(n__incr(X)) → ACTIVATE(X)
ACTIVATE(n__zip(X1, X2)) → ZIP(activate(X1), activate(X2))
ACTIVATE(n__zip(X1, X2)) → ACTIVATE(X2)
ODDNS → INCR(pairNs)
ACTIVATE(n__oddNs) → ODDNS
ZIP(cons(X, XS), cons(Y, YS)) → ACTIVATE(XS)
pairNs → cons(0, n__incr(n__oddNs))
oddNs → incr(pairNs)
incr(cons(X, XS)) → cons(s(X), n__incr(activate(XS)))
take(0, XS) → nil
take(s(N), cons(X, XS)) → cons(X, n__take(N, activate(XS)))
zip(nil, XS) → nil
zip(X, nil) → nil
zip(cons(X, XS), cons(Y, YS)) → cons(pair(X, Y), n__zip(activate(XS), activate(YS)))
tail(cons(X, XS)) → activate(XS)
repItems(nil) → nil
repItems(cons(X, XS)) → cons(X, n__cons(X, n__repItems(activate(XS))))
incr(X) → n__incr(X)
oddNs → n__oddNs
take(X1, X2) → n__take(X1, X2)
zip(X1, X2) → n__zip(X1, X2)
cons(X1, X2) → n__cons(X1, X2)
repItems(X) → n__repItems(X)
activate(n__incr(X)) → incr(activate(X))
activate(n__oddNs) → oddNs
activate(n__take(X1, X2)) → take(activate(X1), activate(X2))
activate(n__zip(X1, X2)) → zip(activate(X1), activate(X2))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__repItems(X)) → repItems(activate(X))
activate(X) → X
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
ACTIVATE(n__zip(X1, X2)) → ACTIVATE(X1)
ZIP(cons(X, XS), cons(Y, YS)) → ACTIVATE(YS)
ACTIVATE(n__zip(X1, X2)) → ZIP(activate(X1), activate(X2))
ACTIVATE(n__zip(X1, X2)) → ACTIVATE(X2)
ZIP(cons(X, XS), cons(Y, YS)) → ACTIVATE(XS)
Used ordering: Polynomial interpretation [25,35]:
INCR(cons(X, XS)) → ACTIVATE(XS)
ACTIVATE(n__cons(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n__incr(X)) → INCR(activate(X))
ACTIVATE(n__incr(X)) → ACTIVATE(X)
ODDNS → INCR(pairNs)
ACTIVATE(n__oddNs) → ODDNS
The value of delta used in the strict ordering is 1.
POL(zip(x1, x2)) = 1 + x_1 + (3)x_2
POL(n__incr(x1)) = (2)x_1
POL(oddNs) = 0
POL(n__cons(x1, x2)) = x_1 + x_2
POL(n__repItems(x1)) = 4 + (2)x_1
POL(activate(x1)) = x_1
POL(take(x1, x2)) = (2)x_2
POL(0) = 0
POL(repItems(x1)) = 4 + (2)x_1
POL(ODDNS) = 1
POL(cons(x1, x2)) = x_1 + x_2
POL(incr(x1)) = (2)x_1
POL(pair(x1, x2)) = (2)x_2
POL(n__oddNs) = 0
POL(n__take(x1, x2)) = (2)x_2
POL(pairNs) = 0
POL(ZIP(x1, x2)) = 2 + (2)x_1 + (4)x_2
POL(s(x1)) = x_1
POL(n__zip(x1, x2)) = 1 + x_1 + (3)x_2
POL(INCR(x1)) = 1 + (4)x_1
POL(ACTIVATE(x1)) = 1 + (2)x_1
POL(nil) = 0
zip(cons(X, XS), cons(Y, YS)) → cons(pair(X, Y), n__zip(activate(XS), activate(YS)))
zip(nil, XS) → nil
zip(X, nil) → nil
incr(X) → n__incr(X)
oddNs → n__oddNs
repItems(nil) → nil
repItems(cons(X, XS)) → cons(X, n__cons(X, n__repItems(activate(XS))))
cons(X1, X2) → n__cons(X1, X2)
repItems(X) → n__repItems(X)
take(X1, X2) → n__take(X1, X2)
zip(X1, X2) → n__zip(X1, X2)
activate(n__take(X1, X2)) → take(activate(X1), activate(X2))
activate(n__zip(X1, X2)) → zip(activate(X1), activate(X2))
activate(n__incr(X)) → incr(activate(X))
activate(n__oddNs) → oddNs
activate(X) → X
activate(n__repItems(X)) → repItems(activate(X))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
pairNs → cons(0, n__incr(n__oddNs))
incr(cons(X, XS)) → cons(s(X), n__incr(activate(XS)))
oddNs → incr(pairNs)
take(s(N), cons(X, XS)) → cons(X, n__take(N, activate(XS)))
take(0, XS) → nil
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
INCR(cons(X, XS)) → ACTIVATE(XS)
ACTIVATE(n__cons(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n__incr(X)) → INCR(activate(X))
ACTIVATE(n__incr(X)) → ACTIVATE(X)
ODDNS → INCR(pairNs)
ACTIVATE(n__oddNs) → ODDNS
pairNs → cons(0, n__incr(n__oddNs))
oddNs → incr(pairNs)
incr(cons(X, XS)) → cons(s(X), n__incr(activate(XS)))
take(0, XS) → nil
take(s(N), cons(X, XS)) → cons(X, n__take(N, activate(XS)))
zip(nil, XS) → nil
zip(X, nil) → nil
zip(cons(X, XS), cons(Y, YS)) → cons(pair(X, Y), n__zip(activate(XS), activate(YS)))
tail(cons(X, XS)) → activate(XS)
repItems(nil) → nil
repItems(cons(X, XS)) → cons(X, n__cons(X, n__repItems(activate(XS))))
incr(X) → n__incr(X)
oddNs → n__oddNs
take(X1, X2) → n__take(X1, X2)
zip(X1, X2) → n__zip(X1, X2)
cons(X1, X2) → n__cons(X1, X2)
repItems(X) → n__repItems(X)
activate(n__incr(X)) → incr(activate(X))
activate(n__oddNs) → oddNs
activate(n__take(X1, X2)) → take(activate(X1), activate(X2))
activate(n__zip(X1, X2)) → zip(activate(X1), activate(X2))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__repItems(X)) → repItems(activate(X))
activate(X) → X